Vertex to Vertex Geodesics on Platonic Solids
نویسندگان
چکیده
We give a simple proof based on symmetries that there are no geodesics from vertex to itself in the cube, tetrahedron, octahedron, and icosahedron.
منابع مشابه
On discriminativity of vertex-degree-based indices
A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملThe Platonic Solids
The tetrahedron, the cube, the octahedron, the dodecahedron, and the icosahedron. From a first glance, one immediately notices that the Platonic Solids exhibit remarkable symmetry. They are the only convex polyhedra for which the same same regular polygon is used for each face, and the same number of faces meet at each vertex. Their symmetries are aesthetically pleasing, like those of stones cu...
متن کاملVertex-To-Vertex Parallel Radiosity on Clusters of PCs
In this paper we describe the parallel implementation of the Vertex-To-Vertex Radiosity method on a cluster of PC hosts. We rst explain the evaluation of the Form-Factor by casting stochastic rays between pairs of vertices for establishing the visibility ratio between them. We then describe an implementation of the Radiosity computation on top of the millipede system, a strong virtual parallel ...
متن کاملVertex-to-vertex pursuit in a graph
A graph G is given and two players, a cop and a robber, play the folioking game: the cop chooses a vertex, then the robber chooses a vertex, then the players move alternately beginning with the cop. A move consists of staying at one’s present vertex or moving to an adjacent vertex; each move is seen by both players. The cop wins if he manages to occupy the same vertex as the robber, and the rob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Mathematical Monthly
سال: 2023
ISSN: ['1930-0972', '0002-9890']
DOI: https://doi.org/10.1080/00029890.2023.2172298